Cooperative Multi - Thread Parallel Tabu
نویسندگان
چکیده
In this work, we propose a cooperative multi-thread parallel tabu search heuristic for the circuit partitioning problem. This procedure is based on the cooperation of multiple search threads. Each thread implements a diierent variant of a sequential tabu search algorithm, using a diierent combination of initial solution algorithm and move attribute deenition. These threads communicate by exchanging elite solutions. PVM and Linda are used in the implementation of the parallel tabu search procedure. Numerical results reported for a set of ISCAS benchmark circuits illustrate the eeectiveness of the parallel tabu search procedure. Comparative results illustrating the eeciency of the implementations in PVM and Linda are also assessed.
منابع مشابه
Communication Issues in Designing Cooperative Multi-Thread Parallel Searches
Roughly speaking, parallel local search techniques can be divided into three categories: low-level parallelization strategies (e.g., master-slave schemes), solution-space partitioning methods and multi-thread procedures in which several processes explore concurrently the same search space. The multi-thread technique can be further subdivided into independent and cooperative search thread algori...
متن کاملA cooperative parallel meta-heuristic for the vehicle routing problem with time windows
This paper presents a parallel cooperative multi-search method for the vehicle routing problem with time windows. It is based on the solution warehouse strategy, in which several search threads cooperate by asynchronously exchanging information on the best solutions identi0ed. The exchanges are performed through a mechanism, called solution warehouse, which holds and manages a pool of solutions...
متن کاملA mutli-thread tabu search algorithm
Abstract This paper describes a novel refinement to a Tabu search algorithm that has been implemented in an attempt to improve the robustness of the search when applied to particularly complex problems. In this approach, two Tabu searches are carried out in parallel. Each search thread is characterised by it's own short term memory which forces that point out of local optima. However, the two s...
متن کاملA parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems
This paper presents a parallel Tabu search algorithm that utilizes several different neighborhood structures for solving capacitated vehicle routing problems. Single neighborhood or neighborhood combinations are encapsulated in Tabu search threads and they cooperate through a solution pool for the purpose of exploiting their joint power. The computational experiments on 32 large scale benchmark...
متن کاملA cooperative parallel metaheuristic for the capacitated vehicle routing problem
This paper introduces a cooperative parallel metaheuristic for solving the capacitated vehicle routing problem. The proposed metaheuristic consists of multiple parallel tabu search threads that cooperate by asynchronously exchanging best found solutions through a common solution pool. The solutions sent to the pool are clustered according to their similarities. The search history information id...
متن کامل